Unit-Memory Hamming Turbo Codes - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

The Trellis Complexity of Convolutional Codes - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Capacity of Channels with Uncoded-Message Side-Information - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Abstrac t Parallel independent channels where no encoding is allowed for one of the channels are studied. The Slepian-Wolf theorem on source coding of correlated sources is used t o show that any information source whose entropy rate is below the sum of the capacity of the coded channel and the input/output mutual information of the uncoded channel is transmissible with arbitrary reliability. T...

Unit-Memory Hamming Turbo Codes

Jung-Fu Cheng Robert J. McEliece WWW Address: http://www.cco.caltech.edu/~rjm/ California Institute of Technology 116-81, Pasadena, CA 91125, USA (Draft of September 11, 1995)

Interleaver Design Methods for Turbo Codes - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on

It is generally assumed that when a turbo decoder is operating at low bi t error rates, error sequences have small Hamming weights. From this, and properties of turbo encoders, a mathematical structure is developed for interleaver design, permitt ing the identification of quantitatively opt imal interleavers. Simulations show the math captures some b u t not all the essential characterist ics o...

Multilevel Diversity Coding with Symmetrical Connectivity - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on